Decidability of Semi-Holonomic Prehensile Task and Motion Planning
نویسندگان
چکیده
In this paper, we define semi-holonomic controllability (SHC) and a general task and motion planning framework. We give a perturbation algorithm that can take a prehensile task and motion planning (PTAMP) domain and create a jointly-controllable-open (JC-open) variant with practically identical semantics. We then present a decomposition-based algorithm that computes the reachability set of a problem instance if a controllability criterion is met. Finally, by showing that JC-open domains satisfy the controllability criterion, we can conclude that PTAMP is decidable.
منابع مشابه
Optimal Trajectory Planning of a Box Transporter Mobile Robot
This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...
متن کاملCooperative Motion Planning for Non-Holonomic Agents with Value Iteration Networks
Cooperative motion planning is still a challenging task for robots. Recently, Value Iteration Networks (VINs) were proposed to model motion planning tasks as Neural Networks. In this work, we extend VINs to solve cooperative planning tasks under non-holonomic constraints. For this, we interconnect multiple VINs to pay respect to each other’s outputs. Policies for cooperation are generated via i...
متن کاملPassive Non-Prehensile Manipulation of a Specific Object on Predictable Helix Path Based on Mechanical Intelligence
Object manipulation techniques in robotics can be categorized in two major groups including manipulation with and without grasp. The aim of this paper is to develop an object manipulation method where in addition to being grasp-less, the manipulation task is done in a passive approach. In this method, linear and angular positions of the object are changed and its manipulation path is controlled...
متن کاملClosed loop motion planning of cooperating mobile robots using graph connectivity
In this paper we address the problem of planning the motion of a team of cooperating mobile robots subject to constraints on relative configuration imposed by the nature of the task they are executing. We model constraints between robots using a graph where each edge is associated with the interaction between two robots and describes a constraint on relative configurations. We develop a decentr...
متن کاملSample-based motion planning in high-dimensional and differentially-constrained systems
State of the art sample-based path planning algorithms, such as the Rapidly-exploring Random Tree (RRT), have proven to be effective in path planning for systems subject to complex kinematic and geometric constraints. The performance of these algorithms, however, degrade as the dimension of the system increases. Furthermore, sample-based planners rely on distance metrics which do not work well ...
متن کامل